P2P Traffic Optimization based on Congestion Distance and DHT
نویسندگان
چکیده
P2P traffic has brought serious impact on the bearer network, and how to utilize network bandwidth has become a common concern problem for the Internet Service Provider (ISP) and the P2P user. A congestion distance and DHT based P2P traffic optimization method is proposed in this paper. The P2P traffic optimization model imports both aims of the ISP and the P2P user, and the cost of congestion and communication for links is converted into congestion distance uniformly. A distributed scheme with flow controllers and information collectors is realized where information collectors are constructed to a Distributed Hash Table (DHT) overlay. The traffic optimization application case using Bittorrent is discussed, where node selection and choking algorithms are changed. The experiment results show our optimization method can reduce the network traffic of inter autonomous system (AS) substantially, and react to the network congestion automatically, and then the win-win result for the ISP and the P2P user is achieved.
منابع مشابه
Editorial for Computer Networks special issue on "Measurement-based optimization of P2P networking and applications"
Measurement plays an important role in various Peerto-Peer (P2P) applications: for peer selection, data delivery and overlay construction. Since P2P systems may include hundreds of thousands of online peers at the same time, it is necessary for the measurements to be scalable. With a dedicated or co-located measurement element such as a network coordinate system or traffic monitor, a P2P system...
متن کاملReducing Maintenance Overhead in DHT Based Peer-to-Peer Algorithms
DHT based Peer-to-Peer (P2P) algorithms are very promising for their efficient routing performance. However, most commercial P2P systems donot adapt DHT algorithms and still use central facilities or broadcasting based routing mechanisms. One reason impeding the DHT algorithm popularity is the routing information maintenance overhead in DHT algorithms, it generates considerable network traffic ...
متن کاملElastic Routing Table with Probable Performance for Congestion Control in DHT Networks
Structured P2P (DHT) networks based on consistent hashing functions have an inherent load balancing problem. The problem becomes more severe due to the heterogeneity of network nodes and the non-uniform and time-varying file popularity. Existing DHT load balancing algorithms are mainly focused on the issues caused by node heterogeneity. To deal with skewed lookups, this paper presents an elasti...
متن کاملDynamic nodeID based heterogeneity aware p2p system
A lot of research papers discussed Distributed Hash Table (DHT) based p2p systems to promise that idle resources may be efficiently harvested. However, p2p systems are composed of components with extremely heterogeneous availabilities and they will generate heavy information maintenance traffic to keep the efficiency of DHT based p2p systems under churn. In this paper, we suggest a dynamic node...
متن کاملData Sharing in DHT Based P2P Systems
The evolution of peer-to-peer (P2P) systems triggered the building of large scale distributed applications. The main application domain is data sharing across a very large number of highly autonomous participants. Building such data sharing systems is particularly challenging because of the “extreme” characteristics of P2P infrastructures: massive distribution, high churn rate, no global contro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Internet Serv. Inf. Secur.
دوره 6 شماره
صفحات -
تاریخ انتشار 2016